Spectral Methods from Tensor Networks

نویسندگان

چکیده

A tensor network is a diagram that specifies way to “multiply” collection of tensors together produce another (or matrix). Many existing algorithms for problems (such as decomposition and PCA), although they are not presented this way, can be viewed spectral methods on matrices built from simple networks. In work we leverage the full power abstraction design new certain continuous problems. An important challenging family comes orbit recovery, class inference involving group actions (inspired by applications such cryo-electron microscopy). Orbit recovery over finite groups often solved via standard methods. However, infinite groups, no general known. We give algorithm based networks one problem: multi-reference alignment SO(2). Our extends more heterogeneous case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectral Methods for Immunization of Large Networks

Given a network of nodes, minimizing the spread of a contagion using a limited budget is a well-studied problem with applications in network security, viral marketing, social networks, and public health. In real graphs, virus may infect a node which in turn infects its neighbor nodes and this may trigger an epidemic in the whole graph. The goal thus is to select the best k nodes (budget constra...

متن کامل

Spectral Clustering Methods for Multiplex Networks

Multiplex networks offer an important tool for the study of complex systems and extending techniques originally designed for single–layer networks is an important area of study. One of the most important methods for analyzing networks is clustering the nodes into communities that represent common connectivity patterns. In this paper we extend spectral clustering to multiplex structures and disc...

متن کامل

Spectral algorithms for tensor completion

Abstract. In the tensor completion problem, one seeks to estimate a low-rank tensor based on a random sample of revealed entries. In terms of the required sample size, earlier work revealed a large gap between estimation with unbounded computational resources (using, for instance, tensor nuclear norm minimization) and polynomial-time algorithms. Among the latter, the best statistical guarantees...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Computing

سال: 2023

ISSN: ['1095-7111', '0097-5397']

DOI: https://doi.org/10.1137/20m1311661